An automata-theoretic approach to constraint LTL

An Automata-Theoretic Approach to Constraint LTL

We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidability of the logic for the constraint systems (Z, <,=) and (N, <,=). Along the way, we give an automata-theoretic proof of a result of [1] when the constraint system satisfies the completion property. Our decision proce...

S . Demri and D . D ’ Souza An Automata − Theoretic Approach to Constraint LTL

An Automata-Theoretic Approach to Minimalism

Vijay-Shanker et al. (1987) note that many interesting linguistic formalisms can be thought of as having essentially context-free structure, but operating over objects richer than simple strings (sequences of strings, trees, or graphs). They introduce linear context-free rewriting systems (LCFRS’s, see also Weir (1988)) as a unifying framework for superficially different such formalisms (like (...

An Automata-Theoretic Approach to Regular XPath

In this paper we present Regular XPath (RXPath), which is a natural extension of XPath with regular expressions over paths that has the same computational properties as XPath: linear-time query evaluation and exponential-time reasoning. To establish these results, we devise a unifying automata-theoretic framework based on two-way weak alternating tree automata. Specifically, we consider automat...

An Automata - Theoretic Approach to Modular ModelCheckingORNA

In modular veriication the speciication of a module consists of two parts. One part describes the guaranteed behavior of the module. The other part describes the assumed behavior of the system in which the module is interacting. This is called the assume-guarantee paradigm. In this paper we consider assume-guarantee speciications in which the guarantee is speciied by branching temporal formulas...